The K-discs Algorithm and Its Kernelization
نویسنده
چکیده
A new clustering algorithm called k-discs is introduced. This algorithm, though similar to k-means, addresses the de ciencies of k-means as well as its variant k-subspaces. The k-discs algorithm is applied to the recovery of manifolds from noisy samplings. A kernelization of k-discs is exhibited, and the advantages of this modi cation are demonstrated on synthetic data. For this project, the kernelized and linear algorithms were implemented from scratch in MATLAB.
منابع مشابه
Streaming Kernelization
Kernelization is a formalization of preprocessing for combinatorially hard problems. We modify the standard definition for kernelization, which allows any polynomial-time algorithm for the preprocessing, by requiring instead that the preprocessing runs in a streaming setting and uses O(poly(k) log |x|) bits of memory on instances (x, k). We obtain several results in this new setting, depending ...
متن کاملGraph-Modeled Data Clustering
ly speaking, what have we done in the previous section? After applying a number of rules in polynomial time to an instance of VERTEX COVER, we arrived at a reduced instance whose size can solely be expressed in terms of the parameter k. Since this can be easily done in O(n) time, we have found a data reduction for VERTEX COVER with guarantees concerning its running time as well as its effective...
متن کاملLarge Isolating Cuts Shrink the Multiway Cut
We propose a preprocessing algorithm for the multiway cut problem that establishes its polynomial kernelizability when the difference between the parameter k and the size of the smallest isolating cut is at most log(k). To the best of our knowledge, this is the first progress towards kernelization of the multiway cut problem. We pose two open questions that, if answered affirmatively, would imp...
متن کاملEven Faster Algorithm for Set Splitting!
In the p-Set Splitting problem we are given a universe U , a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that there are at least k sets in F that have non-empty intersection with both B and W . In this paper we study p-Set Splitting from the view point of kernelization and parameterized algorithms. Given an instance (U,F , k)...
متن کاملTuring Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes
We analyze the potential for provably effective preprocessing for the problems of finding paths and cycles with at least k edges. Several years ago, the question was raised whether the existing superpolynomial kernelization lower bounds for k-Path and k-Cycle can be circumvented by relaxing the requirement that the preprocessing algorithm outputs a single instance. To this date, very few exampl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012